Introduction to Homomorphic Encryption
نویسنده
چکیده
Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe how to apply homomorphic encryption to secure computation protocols.
منابع مشابه
Fully Homomorphic Encryption for Mathematicians
We give an introduction to Fully Homomorphic Encryption for mathematicians. Fully Homomorphic Encryption allows untrusted parties to take encrypted data Enc(m1), . . . ,Enc(mt) and any efficiently computable function f , and compute an encryption of f(m1, . . . ,mt), without knowing or learning the decryption key or the raw data m1, . . . ,mt. The problem of how to do this was recently solved b...
متن کاملHomomorphic Encryption Schemes: Steps to Improve the Proficiency
Homomorphic encryption schemes are malleable by design. In this paper, we find different approaches to practical homomorphic encryption schemes. Partial homomorphic encryption schemes, we observe that the main bottleneck of this scheme is that it is capable of or adapted for turning easily from one to another of various tasks. To solve this problem, we propose general approach to improve the ve...
متن کاملHomomorphic Authenticated Encryption Secure against Chosen-Ciphertext Attack
We study homomorphic authenticated encryption, where privacy and authenticity of data are protected simultaneously. We define homomorphic versions of various security notions for privacy and authenticity, and investigate relations between them. In particular, we show that it is possible to give a natural definition of IND-CCA for homomorphic authenticated encryption, unlike the case of homomorp...
متن کاملOn Homomorphic Encryption and Enhanced Trapdoor Permutations
In this thesis we study two remotely related cryptographic primitives: homomorphic encryption and enhanced trapdoor permutations. Our main result regarding homomorphic encryption shows that any private-key encryption scheme that is weakly homomorphic with respect to addition modulo 2, can be transformed into a public-key encryption scheme. The homomorphic feature referred to is a minimalistic o...
متن کاملHomomorphic Encryption with Access Policies: Characterization and New Constructions
A characterization of predicate encryption (PE) with support for homomorphic operations is presented and we describe the homomorphic properties of some existing PE constructions. Even for the special case of IBE, there are few known group-homomorphic cryptosystems. Our main construction is an XOR-homomorphic IBE scheme based on the quadratic residuosity problem (variant of the Cocks’ scheme), w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013